Channels, Codes and Capacity
نویسنده
چکیده
In this chapter we introduce our task: communicating a digital message without error (or with as few errors as possible) despite an imperfect communications medium. Figure 1.1 shows a typical communications system. In this text we will assume that our source is producing binary data, but it could equally be an analog source followed by analog-to-digital conversion. Through the early 1940s, engineers designing the first digital communications systems, based on pulse code modulation, worked on the assumption that information could be transmitted usefully in digital form over noise-corrupted communication channels but only in such a way that the transmission was unavoidably compromised. The effects of noise could be managed, it was believed, only by increasing the transmitted signal power enough to ensure that the received signal-to-noise ratio was sufficiently high. Shannon’s revolutionary 1948 work changed this view in a fundamental way, showing that it is possible to transmit digital data with arbitrarily high reliability, over noise-corrupted channels, by encoding the digital message with an error correction code prior to transmission and subsequently decoding it at the receiver. The error correction encoder maps each vector of K digits representing the message to longer vectors of N digits known as codewords. The redundancy implicit in the transmission of codewords, rather than the raw data alone, is the quid pro quo for achieving reliable communication over intrinsically unreliable channels. The code rate r = K/N defines the amount of redundancy added by the error correction code. The transmitted bits may be corrupted in some way by the channel, and it is the function of the error correction decoder to use the added redundancy to determine the corresponding K message bits despite the imperfect reception. In this chapter we will introduce the basic ideas behind error correction. In Section 1.1 we describe the channels considered in this text and in Section 1.2 the fundamental limits to communicating on those channels. Finally, in Section 1.3 we introduce error correction techniques.
منابع مشابه
Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملThe capacity of Abelian group codes over symmetric channels
In this paper the capacity achievable by Abelian group codes when employed over symmetric channels is determined. For certain important examples, like the AWGN channel with m-PSK modulation, it follows that this capacity coincides with the corresponding Shannon capacity of these channels. In other words using Abelian group codes in this case there is no loss of capacity (as it happens for binar...
متن کاملCapacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels
ABSTRACT In this paper, we investigate the limitations of capacity-based random code constructions for the wiretap channel, i.e., constructions that associate to each confidential message a subcode whose rate approaches the capacity of the eavesdropper’s channel. Generalizing a previous result for binary symmetric channels, we show that random capacity-based codes do not achieve the strong secr...
متن کاملCodes That Achieve Capacity on Symmetric Channels
Transmission of information reliably and efficiently across channels is one of the fundamental goals of coding and information theory. In this respect, efficiently decodable deterministic coding schemes which achieve capacity provably have been elusive until as recent as 2008, even though schemes which come close to it in practice existed. This survey tries to give the interested reader an over...
متن کاملEmpirical Output Distribution of Good Delay-Limited Codes for Quasi-Static Fading Channels
This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-n delay-limited codes for a quasi-static fading channel is said to be capacityachieving if the codes achieve the delay-limited capacity, which is defined to be the maximum rate achievable by delay-limited codes. The delay-limited capacity is sometimes refer...
متن کاملStatistical mechanics of LDPC codes on channels with memory
Introduction. – A common problem in modern mobile telecommunication systems is that the strength of the signal varies over time as a result of e.g. the motion of the receiver with respect to the source and the varying number of obstacles that shadow the signal over time. Channels describing communication of attenuated signals are termed ‘fading channels’. Fading channels are modeled by finite-s...
متن کامل